Matching Points with Squares
نویسندگان
چکیده
منابع مشابه
Matching Points with Squares
Given a class C of geometric objects and a point set P , a C-matching of P is a set M = {C1, . . . , Ck} ⊆ C of elements of C such that each Ci contains exactly two elements of P and each element of P lies in at most one Ci. If all of the elements of P belong to some Ci, M is called a perfect matching. If, in addition, all of the elements of M are pairwise disjoint, we say that this matching M ...
متن کاملMatching Points with Rectangles and Squares
In this paper we deal with the following natural family of geometric matching problems. Given a class C of geometric objects and a point set P , a C-matching is a set M ⊆ C such that every C ∈ M contains exactly two elements of P . The matching is perfect if it covers every point, and strong if the objects do not intersect. We concentrate on matching points using axis-aligned squares and rectan...
متن کاملMatching Points with Things
Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their number is at most 2. When the objects are line segments,...
متن کاملWeak Matching Points with Triangles
In this paper, we study the weak point matching problem for a given set of n points and a class of equilateral triangles. The problem is to find the maximum cardinality matching of the points using equilateral triangles such that each triangle contains exactly two points and each point lies at most in one triangle. Under the non-degeneracy assumption, we present an O(n) time algorithm using the...
متن کاملMatching surfaces with characteristic points
We study approximation algorithms for a matching problem that is motivated by medical applications. Given a small set of points P ⊂ R and a surface S, the optimal matching of P with S is represented by a rigid transformation which maps P as ‘close as possible’ to S. Previous solutions either require polynomial runtime of high degree [2] or they make use of heuristic techniques which could be tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2008
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-008-9099-1